home *** CD-ROM | disk | FTP | other *** search
/ Power Programmierung 2 / Power-Programmierung CD 2 (Tewi)(1994).iso / c / library / dos / diverses / leda / incl / dic_m.h < prev    next >
Encoding:
C/C++ Source or Header  |  1991-11-15  |  4.5 KB  |  118 lines
  1. /*******************************************************************************
  2. +
  3. +  LEDA  2.1.1                                                 11-15-1991
  4. +
  5. +
  6. +  DIC_M.h
  7. +
  8. +
  9. +  Copyright (c) 1991  by  Max-Planck-Institut fuer Informatik
  10. +  Im Stadtwald, 6600 Saarbruecken, FRG     
  11. +  All rights reserved.
  12. + 
  13. *******************************************************************************/
  14.  
  15.  
  16. #ifndef DICTIONARY_H
  17. #define DICTIONARY_H
  18.  
  19. #include <LEDA/rb_tree.h>
  20.  
  21. typedef rb_tree_item dic_item;
  22.  
  23. #define dictionary(keytype,infotype) name3(keytype,infotype,dictionary)
  24.  
  25. #define dictionarydeclare2(keytype,infotype)\
  26. \
  27. class dictionary(keytype,infotype) : public rb_tree {\
  28. \
  29. int  cmp(ent& x, ent& y) const { return compare((keytype&)x,(keytype&)y); }\
  30. void clear_key(ent& x)   const { Clear((keytype&)x); }\
  31. void clear_inf(ent& x)   const { Clear((infotype&)x); }\
  32. void copy_key(ent& x)    const { Copy((keytype&)x); }\
  33. void copy_inf(ent& x)    const { Copy((infotype&)x); }\
  34. \
  35. public:\
  36. \
  37. virtual int      defined(keytype y) const { return rb_tree::member(Ent(y)); }\
  38. virtual dic_item lookup(keytype y)  const { return rb_tree::lookup(Ent(y)); }\
  39. virtual void     change_inf(dic_item it, infotype i)\
  40.                                      { rb_tree::change_inf(it,Ent(i)); }\
  41. \
  42. virtual dic_item insert(keytype y,infotype x)\
  43.                                      { return rb_tree::insert(Ent(y),Ent(x)); } \
  44. \
  45. virtual void     del(keytype y)          { rb_tree::del(Ent(y)); } \
  46. virtual void     del_item(dic_item it)   { rb_tree::del_item(it); } \
  47. virtual keytype  key(dic_item it)  const { return keytype(rb_tree::key(it));  }\
  48. virtual infotype inf(dic_item it)  const { return infotype(rb_tree::inf(it));}\
  49.         infotype access(keytype k) const { return inf(lookup(k));}\
  50. \
  51. virtual bool     empty() const { return rb_tree::empty(); }\
  52. virtual int      size()  const { return rb_tree::size(); }\
  53. virtual dic_item first_item() const { return rb_tree::first_item(); }\
  54. virtual dic_item next_item(dic_item it) const { return rb_tree::next_item(it); }\
  55. \
  56. virtual dictionary(keytype,infotype)& operator=(const dictionary(keytype,infotype)& D)\
  57. { return (dictionary(keytype,infotype)&)rb_tree::operator=((rb_tree&) D); }\
  58. \
  59.  dictionary(keytype,infotype)()   {}\
  60.  dictionary(keytype,infotype)(const dictionary(keytype,infotype)& D) :\
  61.   rb_tree((rb_tree&) D)   {}\
  62. ~dictionary(keytype,infotype)()   { rb_tree::clear(); }\
  63. } ;
  64.  
  65.  
  66.  
  67. #define ITEM(T) name2(T,_item)
  68.  
  69. #define DICTIONARY(ktype,itype,impl) name4(itype,ktype,impl,dictionary)
  70.  
  71.  
  72. #define DICTIONARYdeclare3(keytype,infotype,impl)\
  73. \
  74. class DICTIONARY(keytype,infotype,impl) : public dictionary(keytype,infotype),\
  75.                                           public impl {\
  76. int  cmp(ent& x, ent& y) const { return compare((keytype&)x,(keytype&)y); }\
  77. void clear_key(ent& x)   const { Clear((keytype&)x); }\
  78. void clear_inf(ent& x)   const { Clear((infotype&)x); }\
  79. void copy_key(ent& x)    const { Copy((keytype&)x); }\
  80. void copy_inf(ent& x)    const { Copy((infotype&)x); }\
  81. \
  82. public:\
  83. \
  84. int       defined(keytype y) const { return impl::member(Ent(y)); }\
  85. dic_item  lookup(keytype y)  const { return dic_item(impl::lookup(Ent(y))); }\
  86. void      change_inf(dic_item it, infotype i)\
  87.                                      { impl::change_inf(ITEM(impl)(it),Ent(i));}\
  88. \
  89. dic_item  insert(keytype y,infotype x)\
  90.                                      { return dic_item(impl::insert(Ent(y),Ent(x))); } \
  91. \
  92. void      del(keytype y)          { impl::del(Ent(y)); } \
  93. void      del_item(dic_item it)   { impl::del_item(ITEM(impl)(it)); } \
  94. keytype   key(dic_item it)  const { return keytype(impl::key(ITEM(impl)(it)));  }\
  95. infotype  inf(dic_item it)  const { return infotype(impl::inf(ITEM(impl)(it)));}\
  96. \
  97. bool  empty() const { return impl::empty(); }\
  98. int   size()  const { return impl::size(); }\
  99. dic_item first_item() const { return dic_item(impl::first_item()); }\
  100. dic_item next_item(dic_item it) const { return dic_item(impl::next_item(ITEM(impl)(it))); }\
  101. \
  102. dictionary(keytype,infotype)& operator =(const dictionary(keytype,infotype)& D)\
  103. { return (DICTIONARY(keytype,infotype,impl)&)impl::operator=((impl&) D); }\
  104. \
  105.  DICTIONARY(keytype,infotype,impl)()   {}\
  106.  DICTIONARY(keytype,infotype,impl)(const DICTIONARY(keytype,infotype,impl)& D) :\
  107.   impl((impl&) D)   {}\
  108. ~DICTIONARY(keytype,infotype,impl)()   { impl::clear(); }\
  109. } ;
  110.  
  111. // ----------------------------------------------------------------
  112. // iteration
  113. // ----------------------------------------------------------------
  114.  
  115. #define forall_dic_items(i,D) for(i = (D).first_item(); i; i=(D).next_item(i))
  116.  
  117. #endif
  118.